Accuracy versus run time in an adiabatic quantum search
نویسندگان
چکیده
منابع مشابه
Accuracy versus run time in an adiabatic quantum search
A. T. Rezakhani,1,2,3 A. K. Pimachev,1,2 and D. A. Lidar1,2,4,5 1Department of Chemistry, University of Southern California, Los Angeles, California 90089, USA 2Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USA 3Department of Physics, Sharif University of Technology, Tehran, Iran 4Department of Physics, University of South...
متن کاملImproving the Accuracy of an Adiabatic Quantum Computer
The purpose of the D-Wave adiabatic quantum computer is to find a set of qubit values that minimize its objective function. For various reasons, the set of qubit values returned by the D-Wave has errors. This paper presents a method of improving the results returned by the D-Wave. The method individually modifies the qubit values returned by the D-Wave to find a set of values which is a minimum...
متن کاملAdiabatic Quantum Search in Open Systems.
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. In isolated systems, a key limitation to such algorithms is the presence of avoided level crossings, where gaps become extremely small. In open quantum systems, the fundamental robustness of adiabatic algorithms remains unresolved. Here, we study the dynamics near an avoided level crossing associated w...
متن کاملQuantum search by local adiabatic evolution
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover’s problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate...
متن کاملAdiabatic quantum search algorithm for structured problems
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2010
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.82.052305